Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes

نویسندگان

  • Alexander V. Ivashchenko
  • Yeong-Nan Yeh
چکیده

Contractible transformations of graphs consist of contractible gluing and deleting of vertices and edges of graphs. They partition all graphs into the family of homotopy classes. Contractible transformations do not change the Euler characteristic and the homology groups of graphs. In this paper we describe the minimal representatives of some homotopy classes and find the formula for computing the Euler characteristic of partite and some other graphs. We also describe the minimal graphs of a projective plane, a torus and a sphere.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing Solvable Graphs for Multiple Moving Agents

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

متن کامل

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

Cohen-Macaulay $r$-partite graphs with minimal clique cover

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

متن کامل

An algorithm for embedding graphs in the torus∗

An efficient algorithm for embedding graphs in the torus is presented. Given a graph G, the algorithm either returns an embedding ofG in the torus or a subgraph ofG which is a subdivision of a minimal nontoroidal graph. The algorithm based on [13] avoids the most complicated step of [13] by applying a recent result of Fiedler, Huneke, Richter, and Robertson [5] about the genus of graphs in the ...

متن کامل

Digital cohomology groups of certain minimal surfaces

In this study, we compute simplicial cohomology groups with different coefficients of a connected sum of certain minimal simple surfaces by using the universal coefficient theorem for cohomology groups. The method used in this paper is a different way to compute digital cohomology groups of minimal simple surfaces. We also prove some theorems related to degree properties of a map on digital sph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 126  شماره 

صفحات  -

تاریخ انتشار 1994